Broadcast Channel Coding with Multiple Transmit Antennae

In this project we first define the model of a broadcast channel in the network information theory basis. This model was proposed in the pioneering work of Cover [1] for the first time. Then we will pay attention to the fact that in a broadcast network, interference from other users can be counted as side information known to the sender. The causal side information was discussed by Shannon in [2]and non causal case in [3]. we will mention new results in [4],[5] and will analyze the Duality technics used in [6] and [7]. An intelligent use of side information , results in a new scheme for cancelling known interference named “dirty paper coding”[8]. We will mention some generalizations to this scheme too[9]. Due to the increase in the capacity of channel by using multiple antennas [10],[11], Space Time Coding technics were presented for multi-antenna transmitters and receivers[12],[13],[14],[15]. Based on broadcasting schemes proposed in [16],[17],[18], [19],[20],[21],[22],[23],we try to devise new channel coding schemes for broadcasting in Multiple Antennas topologies. Our design contains code construction and analysis of probability of error.To solve the problem we try to implement the embedding process mentioned in [1] that achieves more capacity than Simple time sharing. We will redefine the “Diversity” concept for a broadcast channel and we will use the duality concepts existent for channel and source coding[24] in order to have “Dirty Paper” coding schemes implemented in this case.